On factorization of Hilbert–Schmidt mappings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$n$-factorization Property of Bilinear Mappings

In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...

متن کامل

Surjective factorization of holomorphic mappings

We characterize the holomorphic mappings f between complex Banach spaces that may be written in the form f = T ◦ g, where g is another holomorphic mapping and T belongs to a closed surjective operator ideal.

متن کامل

A Factorization Theorem for Logharmonic Mappings

We give the necessary and sufficient condition on sense-preserving logharmonic mapping in order to be factorized as the composition of analytic function followed by a univalent logharmonic mapping. Let D be a domain of C and denote by H(D) the linear space of all analytic functions defined on D. A logharmonic mapping is a solution of the nonlinear elliptic partial differential equation f z = a ...

متن کامل

On semi weak factorization structures

In this article the notions of semi weak orthogonality and semi weak factorization structure in a category $mathcal X$ are introduced. Then the relationship between semi weak factorization structures and quasi right (left) and weak factorization structures is given. The main result is a characterization of semi weak orthogonality, factorization of morphisms, and semi weak factorization structur...

متن کامل

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2005

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2004.09.008